Optimal register allocation for SSA-form programs in polynomial time
نویسندگان
چکیده
This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs. 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Register allocation for programs in SSA form
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation architecture for programs in SSA-form which simplifies register allocation significantly. We investigate certain properties of SSA-programs and their interference graphs, showing that they belong to the class of chor...
متن کاملOptimal Polynomial-Time Interprocedural Register Allocation for High-Level Synthesis Using SSA Form
An optimal, polynomial-time algorithm for interprocedural register allocation in high-level synthesis and ASIP design is presented. The algorithm determines the minimum number of registers required to store all scalar variables in an application without spilling any to memory. Although an optimal polynomialtime algorithm has been presented in the past for individual procedures in Static Single ...
متن کاملStatic Single Assignment Form and the Dominance Relation
A procedure is defined to be strict if every variable is defined before it is used along every path of program execution. A regular program is a strict procedure in Static Single Assignment (SSA) Form. Recently, it has been proven that the interference graph for regular program is a chordal graph. This yielded an optimal polynomial-time algorithm for register allocation for high-level synthesis...
متن کاملRegister Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference graph of a program in static single assignment (SSA) form is chordal and therefore colorable in linear time. Can we use the result of Bouchez et al. to do register allocation in polynomial time by first transforming the...
متن کاملTowards Register Allocation for Programs in SSA-form
In this technical report, we present an architecture for register allocation on the SSA-form. We show, how the properties of SSA-form programs and their interference graphs can be exploited to develop new methods for spilling, coloring and coalescing. We present heuristic and optimal solution methods for these three subtasks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 98 شماره
صفحات -
تاریخ انتشار 2006